On the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e268" altimg="si6.svg"><mml:mi>q</mml:mi></mml:math>-enumeration of barely set-valued tableaux and plane partitions

نویسندگان

چکیده

Barely set-valued tableaux are a variant of Young in which one box contains two numbers as its entry. It has recently been discovered that there product formulas enumerating certain classes barely tableaux. We give some q-analogs these by introducing version major index for also and plane partitions. Many the results stated generality P-partitions then specialize to particularly nice rectangles minuscule posets. The proofs use several probability distributions on set order ideals poset, depending real parameter q>0, we think could be independent interest.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of Cylindric Plane Partitions

Résumé. Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions. A generating series for the enumeration of cylindric plane partitions was recently given by Borodin. As in the reverse plane partition case, the right hand side of this identity admits a simple factorization form in terms of the “hook lengths” of the individual boxes in the underlying s...

متن کامل

(-1)-Enumeration of Self-Complementary Plane Partitions

Abstract. We prove a product formula for the remaining cases of the weighted enumeration of self–complementary plane partitions contained in a given box where adding one half of an orbit of cubes and removing the other half of the orbit changes the sign of the weight. We use nonintersecting lattice path families to express this enumeration as a Pfaffian which can be expressed in terms of the kn...

متن کامل

Tableaux and plane partitions of truncated shapes ( extended abstract )

We consider a new kind of straight and shifted plane partitions/Young tableaux — ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the number of standard tableaux in certain cases, namely a shifted staircase without the box in its upper right corner, i.e. truncated by a box, a rectangle truncated b...

متن کامل

Enumeration of Trees by Vertex-Set Partitions

Generating functions are given for labeled tree enumeration by the number of edges with a spe-ciic color in a 2-color scheme, or equivalently, the number of vertex-set partitions. Two cases are considered, one with each tree assigned a unit weight and the other with vertex-order weight factors. The procedure followed here is readily generalizable to more than two colors. Tree graphs, noncyclic ...

متن کامل

Bumping algorithm for set-valued shifted tableaux

We present an insertion algorithm of Robinson–Schensted type that applies to set-valued shifted Young tableaux. Our algorithm is a generalization of both set-valued non-shifted tableaux by Buch and non set-valued shifted tableaux by Worley and Sagan. As an application, we obtain a Pieri rule for a K-theoretic analogue of the Schur Q-functions. Résumé Nous présentons un algorithme d’insertion de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2023

ISSN: ['1095-9971', '0195-6698']

DOI: https://doi.org/10.1016/j.ejc.2023.103760